On Fast and Approximate Attack Tree Computations
نویسندگان
چکیده
In this paper we address the problem of inefficiency of exact attack tree computations. We propose several implementation-level optimizations and introduce a genetic algorithm for fast approximate computations. Our experiments show that for attack trees having less than 30 leaves, the confidence level of 89% can be achieved within 2 seconds using this algorithm. The approximation scales very well and attack trees of practical size (up to 100 leaves) can be analyzed within a few minutes.
منابع مشابه
Hypersonic Laminar Instability on Round Cones Near Zero Angle of Attack
Reliable predictions for hypersonic laminarturbulent transition will have to be based on simulation of the transition mechanisms. Accurate simulation of the second-mode instability-wave growth on a round cone at zero angle of attack would be a significant step toward this goal. Hypersonic stability experiments in this geometry are reviewed, and three are selected. Extensive and previously unpub...
متن کاملExplicit model predictive control of gas-liquid separation plant via orthogonal search tree partitioning
Solutions to constrained linear model predictive control (MPC) problems can be pre-computed off-line in an explicit form as a piecewise linear (PWL) state feedback defined on a polyhedral partition of the state space. This admits implementation at high sampling frequencies in real-time systems with high reliability and low software complexity. Recently, algorithms that determine an approximate ...
متن کاملF-STONE: A Fast Real-Time DDOS Attack Detection Method Using an Improved Historical Memory Management
Distributed Denial of Service (DDoS) is a common attack in recent years that can deplete the bandwidth of victim nodes by flooding packets. Based on the type and quantity of traffic used for the attack and the exploited vulnerability of the target, DDoS attacks are grouped into three categories as Volumetric attacks, Protocol attacks and Application attacks. The volumetric attack, which the pro...
متن کاملObtaining Exact Value by Approximate Computations *
Numerical approximate computation can solve large and complex problems fast. It has the advantage of high efficiency. However it only gives approximate results, whereas we need exact results in many fields. There is a gap between approximate computation and exact results. In this paper, we build a bridge by which exact results can be obtained by numerical approximate computations.
متن کاملInverse Modeling and Animation of Growing Single-stemmed Trees at Interactive Rates
For city planning purposes, animations of growing trees of several species can be used to deduce which species may best fit a particular environment. The models used for the animation must conform to real measured data. We present an approach for inverse modeling to fit global growth parameters. The model comprises local production rules, which are iteratively and simultaneously applied to buil...
متن کامل